Distance-regularity and the spectrum of graphs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizing distance-regularity of graphs by the spectrum

We characterize the distance-regular Ivanov–Ivanov–Faradjev graph from the spectrum, and construct cospectral graphs of the Johnson graphs, Doubled Odd graphs, Grassmann graphs, Doubled Grassmann graphs, antipodal covers of complete bipartite graphs, and many of the Taylor graphs. We survey the known results on cospectral graphs of the Hamming graphs, and of all distance-regular graphs on at mo...

متن کامل

Distance regularity of compositions of graphs

We study preservation of distance regularity when taking strong sums and strong products of distance-regular graphs. MSC 2000 Classification: 05C12

متن کامل

Distance regularity in direct-product graphs

K e y w o r d s D i s t a n c e r e g u l a r graphs, Direct product. 1. I N T R O D U C T I O N E v e r y c o n n e c t e d g r a p h is r e p r e s e n t a b l e by m e a n s o f a level diagram (cf. [1]) as follows. C h o o s e a v e r t e x u, a n d le t i t be t h e sole r e s iden t of level zero. T h e ve r t i c e s on level i a re p rec i se ly t h o s e w h o s e d i s t a n c e f r o...

متن کامل

On the distance eigenvalues of Cayley graphs

In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...

متن کامل

The spectrum of the hyper-star graphs and their line graphs

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 1996

ISSN: 0024-3795

DOI: 10.1016/0024-3795(94)00166-9